Geometric notes on optimization with equality constraints
نویسندگان
چکیده
منابع مشابه
Nonlinear Robust Optimization with Uncertain Equality Constraints
The problem of nonlinear optimization for process design under uncertainty is addressed in this paper. A novel robust optimization framework is proposed to address general nonlinear problems under uncertainty. To address the limitation of single point linearization with respect to uncertain parameters for a large uncertainty region, an iterative algorithm is developed. The new method applies lo...
متن کاملOptimization of Caching Devices with Geometric Constraints
It has been recently advocated that in large communication systems it is beneficial both for the users and for the network as a whole to store content closer to users. One particular implementation of such an approach is to co-locate caches with wireless base stations. In this paper we study geographically distributed caching of a fixed collection of files. We model cache placement with the hel...
متن کاملStochastic geometric optimization with joint probabilistic constraints
This paper discusses geometric programs with joint probabilistic constraints. When the stochastic parameters are normally distributed and independent of each other, we approximate the problem by using piecewise polynomial functions with non-negative coefficients, and transform the approximation problem into a convex geometric program. We prove that this approximation method provides a lower bou...
متن کاملControl Problems with Equality Constraints
not available at time of publication. Dimitris Bertsimas Massachusetts Insitute of Technology [email protected] MS8 Less is More: Robustness and Sparsity in Multivariate Statistics We describe applications of robust optimization in the context of machine learning, with a focus on classification and regression, principal component analysis and fitting of graphical models. In these tasks, sparsity...
متن کاملEntailment with Conditional Equality Constraints
Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend equality constraints with a weak form of subtyping to allow for more accurate analyses. We give a complete complexity characterization of the various entailment problems for conditional equality constraints. Additionally...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1996
ISSN: 0893-9659
DOI: 10.1016/0893-9659(96)00037-7